منابع مشابه
Instantiation Reduction in Iterative Parameterised Three-Valued Model Checking
Here we prove Lemma 3 from the paper Instantiation Reduction in Iterative Parameterised Three-Valued Model Checking submitted to SBMF 2015. According to our parameterisation rules defined in [1], the application of parameterisation (and parameter instantiation) only affects the values of transitions an labellings but not the state space. Thus, M (Bn) and M (Bn)(Bm) in Lemma 3 are both defined o...
متن کاملParallel SAT-Based Parameterised Three-Valued Model Checking
Parameterisation in three-valued model checking (PMC) allows to establish logical connections between unknown parts in state space models. The application of parameterisation enhances the precision of models without increasing their state space, but it leads to an exponential growth of the number of model checking instances that have to be checked consecutively. Here, we introduce a technique f...
متن کاملVerifying Multi-Agent Systems by Model Checking Three-valued Abstractions
We develop the theoretical foundations of a predicate abstraction methodology for the verification of multi-agent systems. We put forward a specification language based on epistemic logic and a weak variant of the logic ATL interpreted on a three-valued semantics. We show that the model checking problem for multi-agent systems in this setting is tractable by giving a provably correct procedure ...
متن کاملModular Verification of Open Features Through Three-Valued Model Checking
Feature-oriented programming organizes programs around features rather than objects, thus better supporting extensible, product-line architectures. Programming languages increasingly support this style of programming, but programmers get little support from verification tools. Ideally, programmers should be able to verify features independently of each other and use automated compositional reas...
متن کاملProperty Driven Three-Valued Model Checking on Hybrid Automata
In this paper, we present a three-valued property driven model checking algorithm for the logic CTL on hybrid automata. The technique of multivalued model checking for hybrid automata aims at combining the advantages of classical methods based either on the preorder of simulation or on bounded reachability. However, as originally defined, it relies on the preliminary definition of special abstr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2016
ISSN: 0167-6423
DOI: 10.1016/j.scico.2016.01.006